A Constraint Logic Programming Systemwith Parametric Domain

TCLP: overloading, subtyping and parametric polymorphism made practical for constraint logic programming

Solving Constraints for an Instance of an Extended CLP Language over a Domain Based on Real Numbers and Herbrand Terms

Combining the logic of hereditary Harrop formulas HH with a constraint system, a logic programming language is obtained that extends Horn clauses in two different directions, thus enhancing substantially the expressivity of Prolog. This new language is parametric over the constraint system. A constraint solver for a particular instance will test the satisfiability of formulas built up by means ...

A Collaborative Parametric Design Agent

ParMan combines the use of agent communication protocols, constraint logic programming, and a graphical presentation interface to yield an intelligent parametric design tool supporting collaborative engineering. This provides one of the first complete, end-toend applications of distributed knowledge-level communication among engineering tools, as envisioned by PACT (Cutkosky et al. 1993). In ad...

Logic Programming over Polymorphically Order-Sorted Types

This thesis presents the foundations for relational logic programming over polymorphically order-sorted data types. This type discipline combines the notion of parametric polymorphism, which has been developed for higher-order functional programming, with the notion of order-sorted typing, which has been developed for equational rst-order speci cation and programming. Polymorphically order-sort...

Typing constraint logic programs

We present a prescriptive type system with parametric polymorphism and subtyping for constraint logic programs. The aim of this type system is to detect programming errors statically. It introduces a type discipline for constraint logic programs and modules, while maintaining the capabilities of performing the usual coercions between constraint domains, and of typing meta-programming predicates...